On Approximability of Block Sorting
نویسندگان
چکیده
Block Sorting is a well studied problem, motivated by its applications in Optical Character Recognition (OCR), and Computational Biology. Block Sorting has been shown to be NP-Hard, and two separate polynomial time 2-approximation algorithms have been designed for the problem. But questions like whether a better approximation algorithm can be designed, and whether the problem is APX-Hard have been open for quite a while now. In this work we answer the latter question by proving Block Sorting to be Max-SNP-Hard (APX-Hard). The APX-Hardness result is based on a linear reduction of Max-3SAT to Block Sorting. We also provide a new lower bound for the problem via a new parametrized problem k-Block Merging.
منابع مشابه
Text Compression using Recency Rank with Context and Relation to Context Sorting, Block Sorting and PPM*
Recently block sorting compression scheme was developed and relation to statistical scheme was studied, but theoretical analysis of performance has not been studied well. Context sorting is a compression scheme based on context similarity and it is regarded as an online version of the block sorting and it is asymptotically optimal. However, the compression speed is slower and the real performan...
متن کاملA quadratic time 2-approximation algorithm for block sorting
We give an approximation algorithm for the block sorting problem with an approximation ratio of 2 and run time O(n). The approximation algorithm is based on the related concept of block deletion. We show that finding an optimum block deletion sequence can be done in O(n) time, while block sorting is known to be NP-hard. Block sorting has importance in connection with optical character recogniti...
متن کاملSorting a Permutation with Block Moves
We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transpositions, and raise some open questions.
متن کاملA Faster and Simpler 2-Approximation Algorithm for Block Sorting
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is NP-hard and all of the previously known heuristics lack proof of any approximation ratio. We present here an approximation algorithm for the block sorting problem with approximation ratio of 2 and run time O(n). The app...
متن کاملImpact of Reminders on Children’s Cognitive Flexibility, Intrinsic Motivation, and Mood Depends on Who Provides the Reminders
Reminding children to think about alternatives is a strategy adults often use to promote children's cognitive flexibility, as well as children's engagement in and enjoyment of the task. The current study investigated whether the impacts of reminders on kindergarten children's cognitive flexibility, intrinsic motivation, and mood are moderated by who provides the reminders. Eighty-three healthy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1110.0892 شماره
صفحات -
تاریخ انتشار 2011